Compatible quadrangulation by sketching
نویسندگان
چکیده
Mesh quadrangulation has received increasing attention in the past decade. While previous works have mostly focused on producing a high quality quad mesh of a single model, the connectivity of the quadrangulation is typically difficult to control and varies among models even with similar shapes. In this paper, we propose a novel interactive framework for quadrangulating a set of models collectively with compatible connectivity. Furthermore, we demonstrate its application to 3D mesh morphing. In our approach, the user interactively sketches a skeleton within each model, and our method automatically computes compatible base domains for all models from these skeletons, on which the models are parameterized. With this novel parameterization, it is very easy to generate a pleasing and smooth 3D morphing sequence among these compatible models. The method yields quadrangulation with comparable quality to existing approaches, but greatly simplifies compatible re-meshing among a group of topologically equivalent models, in particular characters and animals models, with direct applications in shape blending and morphing. Copyright © 2009 John Wiley & Sons, Ltd.
منابع مشابه
On One Property of Distances in the Infinite Random Quadrangulation
We show that the Schaeffer’s tree for an infinite quadrangulation only changes locally when changing the root of the quadrangulation. This follows from one property of distances in the infinite uniform random quadrangulation.
متن کاملSpectral Quadrangulation with Boundary Conformation
Existing spectral quadrangulation methods are effective only for closed surfaces, because they cannot satisfactorily handle surfaces with boundaries or feature lines that need to be respected. We propose an extension to the spectral quadrangulation approach that ensures boundary/feature conformation. Our contributions include the formulation of a set of new boundary conditions and the introduct...
متن کاملQuadrilateral Decomposition by Two-Ear Property Resulting in CAD Segmentation
The objective is to split a simply connected polygon into a set of convex quadrilaterals without inserting new boundary nodes. The presented approach consists in repeatedly removing quadrilaterals from the polygon. Theoretical results pertaining to quadrangulation of simply connected polygons are derived from the usual 2-ear theorem. It produces a quadrangulation technique with O(n) number of q...
متن کاملNo Quadrangulation is Extremely Odd
Given a set S of n points in the plane, a quadrangulation of S is a planar subdivision whose vertices are the points of S, whose outer face is the convex hull of S, and every face of the subdivision (except possibly the outer face) is a quadrilateral. We show that S admits a quadrangulation if and only if S does not have an odd number of extreme points. If S admits a quadrangulation, we present...
متن کاملMinimum Weight Convex Quadrangulation of a Constrained Point Set
A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is convex and has four points from S on its boundary. A minimum weight convex quadrangulation with respect to S is a convex quadrangulation of S such that the sum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Visualization and Computer Animation
دوره 20 شماره
صفحات -
تاریخ انتشار 2009